Potts glass on random graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Potts Antiferromagnet on Random Graphs

Extending a prior result of Contucci et al. [Comm.Math. Phys. 2013], we determine the free energy of the Potts antiferromagnet on the Erdős-Rényi random graph at all temperatures for average degrees d ≤ (2k−1)lnk−2−k−1/2. In particular, we show that for this regime of d there does not occur a phase transition. Mathematics Subject Classification: 05C80 (primary), 05C15 (secondary)

متن کامل

Scale-free random graphs and Potts model

We introduce a simple algorithm that constructs scale-free random graphs efficiently: each vertex i has a prescribed weight Pi ∝ i−μ (0 < μ < 1) and an edge can connect vertices i and j with rate PiPj . Corresponding equilibrium ensemble is identified and the problem is solved by the q → 1 limit of the q-state Potts model with inhomogeneous interactions for all pairs of spins. The number of loo...

متن کامل

Ising and Potts models on quenched random gravity graphs

We report on single-cluster Monte Carlo simulations of the Ising, 4-state Potts and 10-state Potts models on quenched ensembles of planar, tri-valent (Φ3) random graphs. We confirm that the firstorder phase transition of the 10-state Potts model on regular 2D lattices is softened by the quenched connectivity disorder represented by the random graphs and that the exponents of the Ising and 4stat...

متن کامل

Sampling in Potts Model on Sparse Random Graphs

We study the problem of sampling almost uniform proper q-colorings in sparse Erdős-Rényi random graphs G(n, d/n), a research initiated by Dyer, Flaxman, Frieze and Vigoda [2]. We obtain a fully polynomial time almost uniform sampler (FPAUS) for the problem provided q > 3d + 4, improving the current best bound q > 5.5d [6]. Our sampling algorithm works for more generalized models and broader fam...

متن کامل

Evolution of scale-free random graphs: Potts model formulation

We study the bond percolation problem in random graphs of N weighted vertices, where each vertex i has a prescribed weight Pi and an edge can connect vertices i and j with rate PiPj . The problem is solved by the q → 1 limit of the q-state Potts model with inhomogeneous interactions for all pairs of spins. We apply this approach to the static model having Pi ∝ i−μ (0 < μ < 1) so that the result...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EPL (Europhysics Letters)

سال: 2008

ISSN: 0295-5075,1286-4854

DOI: 10.1209/0295-5075/81/57005